Tolerance Synthesis by Constraint Propagation
نویسندگان
چکیده
Optimizing the manufacturing cost is critical in tolerance synthesis. Decreasing the tolerance range will improve performance but will also increase the manufacturing costs. It is desirable to optimize the tolerance range under such constraints of product design as the relationship between the dimensions of entities of a component and the functional requirement of the design. We propose a constraint-based reasoning mechanism to synthesize a new set of tolerances to satisfy the functional requirements of a product and minimizing the manufacturing cost during the tolerance propagation in interval constraint networks by genetic algorithm. A hierarchical interval constraint network and interval propagation techniques for automatic tolerance synthesis are presented in this paper. The nodes in interval constraint networks represent the entities, the attributes, and the functional requirements of the mechanical parameters or the constraint functions. The arcs represent the relationships between the entities, the attributes, the functional requirements and the constraint functions. In tolerance synthesis, given the functional requirement tolerances, the goal is to synthesize a new set of entity tolerances. Backward propagation technique is developed for tolerance synthesis. In backward propagation, the minimization of the manufacturing cost is developed based on genetic algorithm. The goal of the proposed investigation is to develop a constraint-based reasoning technique for tolerance design, which plays an important role in the relationship between performances and manufacturing cost of a product. Such technique should be able to satisfy all the constraints in the tolerance design and minimize the manufacturing cost.
منابع مشابه
Interval constraint networks for tolerance analysis and synthesis
This paper proposes interval constraint networks and interval propagation techniques for automatic tolerance design. To develop an intelligent automatic tolerance design mechanism, the following interrelated problems are addressed: ~1! representing the relationships between the tolerances of the entities, attributes, and the functional requirements of a design component by a constraint network,...
متن کاملParametric Tolerance Analysis of Mechanical Assembly by Developing Direct Constraint Model in CAD and Cost Competent Tolerance Synthesis
The objective of tolerance analysis is to check the extent and nature of variation of an analyzed dimension or geometric feature of interest for a given GD & T scheme. The parametric approach to tolerance analysis is based on parametric constraint solving. The accuracy of simulation results is dependent on the user-defined modeling scheme. Once an accurate CAD model is developed, it is integrat...
متن کاملHandling uncertainties of robot manipulators and active vision by constraint propagation
Joint errors are inevitable in robot manipulation. These uncertainties propagate to give rise to translational and orientational errors in the position and orientation of the robot end-effector. The displacement of the active vision head mounted on the robot endeffector produces distortion of the projected object on the image. Upon active visual inspection, the observed dimension of a mechanica...
متن کاملConstraint Networks: A Survey
A constraint satisfaction problem (CSP) involves a set of variables, a domain of potential values for each variable, and a set of constraints, which speciies the acceptable combinations of values. One popular approach is to represent the original problem as a constraint network where nodes represent variables and arcs represent constraints between variables. Node consistency and arc consistency...
متن کاملDeductive and Inductive Methods for Program Synthesis
The paper discusses simple functional constraint networks and a value propagation method for program construction. Structural synthesis of programs is described as an example of deductive approach to program construction. An inductive method for program synthesis utilizing stochastic optimization algorithms is introduced to complement value propagation techniques.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001